翻訳と辞書 |
Sparse binary polynomial hashing : ウィキペディア英語版 | Sparse binary polynomial hashing Sparse binary polynomial hashing (SBPH) is a generalization of Bayesian filtering that can match mutating phrases as well as single words. SBPH is a way of generating a large number of features from an incoming text automatically, and then using statistics to determine the weights for each of those features in terms of their predictive values for spam/nonspam evaluation. == External links ==
* (A paper on the subject as it relates to spam ) (some article text comes from this document, which is under the GFDL)
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Sparse binary polynomial hashing」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|